Early-Tardy Minimization for Joint Scheduling of Jobs and Maintenance Operations on a Single Machine
نویسندگان
چکیده
In this paper, we consider joint scheduling of jobs and preventive maintenance operations on a single machine with an objective to minimize the total earliness and tardiness of jobs about a common due date. The properties of an optimal schedule are identified and utilized to develop a constructive heuristic and a lower bound estimate. The properties are also utilized to hybridize Tabu search and Simulated Annealing algorithms. A numerical study with over 3200 randomly generated problems is reported to demonstrate the performance of the proposed solution methods. The study shows that the effectiveness of the proposed lower bound and constructive heuristic is sensitive to maintenance related parameters. We also show that hybridized Tabu search and Simulated Annealing algorithms are efficient approaches to solve the problem. KeywordsSingle machine scheduling, Maintenance, Early-Tardy, Common due date, Tabu search and simulated annealing ∗ Corresponding author’s email: [email protected] International Journal of Operations Research
منابع مشابه
Minimizing the Number of Tardy Jobs in the Single Machine Scheduling Problem under Bimodal Flexible and Periodic Availability Constraints
In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...
متن کاملAn approximation algorithm and FPTAS for Tardy/Lost minimization with common due dates on a single machine
This paper addresses the Tardy/Lost penalty minimization with common due dates on a single machine. According to this performance measure, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Initially, we present a 2-approximation algorithm and examine its worst case ratio bound. Then, a pseudo-polynomial dynamic programming algorithm is de...
متن کاملA branch and bound algorithm to minimize the total weighted number of tardy jobs and delivery costs with late deliveries for a supply chain scheduling problem
In this paper, we study a supply chain scheduling problem that simultaneously considers production scheduling and product delivery. jobs have to be scheduled on a single machine and delivered to customers for further processing in batches. The objective is to minimize the sum of the total weighted number of tardy jobs and the delivery costs. In this paper, we present a heuristic algorithm (HA...
متن کاملMinimizing a General Penalty Function on a Single Machine via Developing Approximation Algorithms and FPTASs
This paper addresses the Tardy/Lost penalty minimization on a single machine. According to this penalty criterion, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Besides its application in real world problems, Tardy/Lost measure is a general form for popular objective functions like weighted tardiness, late work and tardiness with reje...
متن کاملScheduling flexible maintenance activities subject to job-dependent machine deterioration
This paper focuses on single machine scheduling subject to machine deterioration. The current maintenance state of the machine is determined by a maintenance level. While jobs are processed this maintenance level drops by a certain, possibly job-dependent, amount. A maintenance level of less than zero is associated with the machine’s breakdown and is therefore forbidden. Consequently, schedule ...
متن کامل